Combining Algebraizable Logics

نویسندگان

  • A. Jánossy
  • Ágnes Kurucz
  • A. E. Eiben
چکیده

The general methodology of “algebraizing” logics (cf. [2], [4]) is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics. The cocompleteness of this category as well as its isomorphism to the corresponding category of certain first-order theories are proved. In this paper we translate the “combining logics” problem to the problem of “combining” certain theories of usual first order logic. We prove that the category of a special class of logics, called algebraizable logical systems (see Def. 1.1 below), is isomorphic to the category of the corresponding first order theories. We also show that these categories are cocomplete. Some directions in which the approach chosen can perhaps be generalized are pointed out in the last section.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possible-translations Algebraizability

The interest of investigating combinations of logics has a philosophical side, a purely logic-theoretical side and promising applicational interests. This paper concentrates on the logic-theoretical side and studies some general methods for combination and decomposition, taking into account that the general idea of combining logics requires methods not only for building new logics, but also for...

متن کامل

Caicedo Implicit Connectives of Algebraizable Logics

An extensions by new axioms and rules of an algebraizable logic in the sense of Blok and Pigozzi is not necessarily algebraizable if it involves new connective symbols, or it may be algebraizable in an essentially different way than the original logic. However, extension whose axioms and rules define implicitly the new connectives are algebraizable, via the same equivalence formulas and definin...

متن کامل

Weakly Algebraizable π-Institutions

Weakly algebraizable sentential logics were introduced by Czelakowski and Jansana and constitute a class in the abstract algebraic hierarchy of logics lying between the protoalgebraic logics of Blok and Pigozzi and the algebraizable logics, in the sense of Czelakowski’s and Hermann’s generalization of the original notion introduced by Blok and Pigozzi. Very recently protoalgebraic π-institution...

متن کامل

On semilattice-based logics with an algebraizable assertional companion

This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its companion assertional logic (defined from the same variety of algebras using the top element as representing truth) is algebraizable. This describes a ...

متن کامل

The equational definability of truth predicates

By a ‘logic’ we mean here a substitution-invariant consequence relation on formulas over an algebraic signature. Propositional logics are obvious examples, but even first order logic can be re-formulated in this way. The notion of an ‘algebraizable’ logic was made precise in the 1980s, mainly by Blok and Pigozzi, who provided intrinsic characterizations of the logics that are indeed algebraizab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 37  شماره 

صفحات  -

تاریخ انتشار 1996